Derivatives for Enhanced Regular Expressions
نویسنده
چکیده
Regular languages are closed under a wealth of formal language operators. Incorporating such operators in regular expressions leads to concise language specifications, but the transformation of such enhanced regular expressions to finite automata becomes more involved. We present an approach that enables the direct construction of finite automata from regular expressions enhanced with further operators that preserve regularity. Our construction is based on an extension of the theory of derivatives for regular expressions. To retain the standard results about derivatives, we develop a derivability criterion for the compatibility of the extra operators with derivatives. Some derivable operators do not preserve regularity. Derivatives provide a decision procedure for the word problem of regular expressions enhanced with such operators.
منابع مشابه
Combining Regular Expressions with Near-Optimal Automata in the FIRE Station Environment
Derivatives of regular expressions were first introduced by Brzozowski in (Brzozowski, 1964). By recursively computing all derivatives of a regular expression, a deterministic automaton can be constructed. To guarantee convergence of this process, derivatives are compared modulo similarity, i.e. modulo associativity, commutativity, and idempotence of the union operator. Additionaly, through sim...
متن کاملDerivatives of Regular Expressions ∗
The paper proposes a characterization of the structure of derivatives, and proves several properties of derivatives. The above work can be used to solve an issue in using Berry and Sethi’s result, i. e., finding the unique representatives of derivatives. keywords: Regular expressions, derivatives, finite automata.
متن کاملForkable Regular Expressions
We consider forkable regular expressions, which enrich regular expressions with a fork operator, to establish a formal basis for static and dynamic analysis of the communication behavior of concurrent programs. We define a novel compositional semantics for forkable expressions, establish their fundamental properties, and define derivatives for them as a basis for the generation of automata, for...
متن کاملDerivatives of Approximate Regular Expressions
Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the notion of distance and we introduce the family of regular expressions extended to similarity operators, that we call AREs (Approximate Regular Expressions). W...
متن کاملFrom $\mu$-Regular Expressions to Pushdown Automata
We extend Antimirov’s partial derivatives from regular expressions to μ-regular expressions that describe context-free languages. We prove the correctness of partial derivatives as well as the finiteness of the set of iterated partial derivatives. The latter are used as pushdown symbols in our construction of a nondeterministic pushdown automaton, which generalizes Antimirov’s NFA construction.
متن کامل